CaSAPI: a system for credulous and sceptical argumentation
نویسندگان
چکیده
We present the CaSAPI system, implementing (a generalisation of) three existing computational mechanisms [8–10] for determining argumentatively whether potential beliefs can be deemed to be acceptable and, if so, for computing supports for them. These mechanisms are defined in terms of dialectical disputes amongst two fictional agents: a proponent agent, eager to determine the acceptability of the beliefs, and an opponent agent, trying to undermine the existence of an acceptable support for the beliefs, by finding attacks against it that the proponent needs to counter-attack in turn. The three mechanisms differ in the level of scepticism of the proponent agent and are defined for (flat) assumption-based argumentation frameworks [3]. Thus, they can serve as decision-making mechanisms for all instances of these frameworks. In this paper we show how they can be used for logic programming, legal reasoning, practical reasoning, and agent reasoning.
منابع مشابه
Argumentation-Based Proof Procedures for Credulous and Sceptical Non-monotonic Reasoning
We define abstract proof procedures for performing credulous and sceptical non-monotonic reasoning, with respect to the argumentation-theoretic formulation of non-monotonic reasoning proposed in [1]. Appropriate instances of the proposed proof procedures provide concrete proof procedures for concrete formalisms for non-monotonic reasoning, for example logic programming with negation as failure ...
متن کاملInductive Defense for Sceptical Semantics of Extended Argumentation
An abstract argumentation framework may have many extensions. Which extension should be adopted as the semantics depends on the sceptical attitudes of the reasoners. Different degrees of scepticism lead to different semantics ranging from the grounded extension as the most sceptical semantics to preferred extensions as the least sceptical semantics. Extending abstract argumentation to allow att...
متن کاملComparing Two Unique Extension Semantics for Formal Argumentation: Ideal and Eager
In formal argumentation, grounded semantics is well known for yielding exactly one unique extension. Since grounded semantics has a very sceptical nature, one can ask the question whether it is possible to define a unique extension semantics that is more credulous. Recent work of Dung, Mancarella and Toni proposes what they call ideal semantics, which is a unique extension semantics that is mor...
متن کاملThe computational complexity of ideal semantics
We analyse the computational complexity of the recently proposed ideal semantics within both abstract argumentation frameworks (AFs) and assumption-based argumentation frameworks (ABFs). It is shown that while typically less tractable than credulous admissibility semantics, the natural decision problems arising with this extension-based model can, perhaps surprisingly, be decided more efficient...
متن کاملA dialectic procedure for sceptical, assumption-based argumentation
We present a procedure for computing the sceptical “ideal semantics” for argumentation in assumption-based frameworks. This semantics was first proposed for logic programming in [1], extending the well-founded semantics. The proof procedure is defined by means of a form of dispute derivations, obtained by modifying the dispute derivations given in [2] for computing credulous admissible argument...
متن کامل